Method for generating a network

ABSTRACT

A method for generating a network, in particular a telecommunications, water, long-distance heat supply, or power network, the network connecting all users to a main distribution node depending on the existing or definable local needs and requirements of the individual users. A graph is generated which is composed of edges and nodes. The graph includes all technically feasible and/or definable transmission paths of the network. The length and direction of the edges are derived from the real topography of the street segments and definable cable paths of the territory to be supplied by the network. The nodes form the intersections between the edges or streets and/or cable paths. The users are assigned to the graph in such a way that each user is connected to the closest edge or the closest node of the graph by an additional service edge. A tree structure is created by removing unnecessary edges from the graph in such a way that the service edges, edges, and nodes of the tree structure form only one connection between the main distribution node and each user. The load of the edges in the tree structure is determined depending on the needs and requirements of the users.

FIELD OF THE INVENTION

The present invention relates to a method for generating and optimizinga network, in particular a telecommunications, water, long-distance heatsupply, or power network.

BACKGROUND INFORMATION

Supply, telecommunications, or, for example, computer networks are verydifficult for a person to set up by hand once they have grown beyond acertain size. When setting up a network, therefore, the most importantconsideration is its proper functioning. Once the network has been setup, it can be optimized only at points. In most cases, serious errorscan no longer be corrected later on.

Depending on the network type and layout, the widest variety oftechnologies can be used. Network planners usually have multiplecomponents at their disposal for solving a specific network problem. Inthe case of telecommunication networks, planners must, among otherthings, decide whether to use a copper or fiber-optic cable for aspecific connection. They must also choose among a wide variety ofcopper and fiber-optic cable types, all of which vary in terms of theircapacities, i.e. transmission rates, number of lines per cable, andmaximum possible transmission ranges.

Up to now, network plans for telecommunication networks that willprovide coverage for a specific territory have almost always been drawnup manually by experienced network planners. As mentioned above, propernetwork functioning is the primary concern when drawing up such plans. Anetwork that has been technically optimized and has the mostcost-effective layout cannot be set up using the currently known networkgeneration methods.

The conventional method for setting up a telecommunications network isdescribed below, only the most important principles being explained.FIG. 1 shows a territory 1 having individual blocks 2 of houses to besupplied from an exchange (HVK) 7. Blocks 2 have individual users 3,whose phone line requirements 4 are indicated. For purposes ofillustration, users 3 in this example do not require any services otherthan phone lines. Blocks 2 are separated from one another by streets 5and street intersections 6. As shown in FIG. 2, the network planner hasdivided territory 1 into areas A through E on the basis of the planningrules established in the past by the carrier and of his store ofexperience, multiple city blocks, such as A1 and A2, usually beingcombined into one area. These areas are referred to below as cabledistribution areas. The territory is divided into cable distributionareas on the basis of the technology to be used and on the basis of thecable typologies defined in the individual countries. The technologydetermines the maximum and optimum size of the individual cabledistribution areas. In the present example, the network planner hasselected, e.g., copper cables, it being possible for one copper cable tohave different pairings, such as 10, 20, 50, 75, 100, 150 or 200 copperpairs (CuDA). The copper cable transmission range is sufficient for allusers, and the maximum capacity of a cable distributor 8 may be 1 00copper pairs. The network planner then establishes the locations ofcable distributors 8 (KVZA–KVZE) from which the distribution cables(VzK) containing the phone lines are run to individual users 3 along thepossible routes, i.e. along the sidewalks and underneath intersections 11, as shown in FIG. 3. The telephone lines of the particular area, whichare bundled into main cables (Hk) 9 are run directly to exchange 7 fromcable distributor 8 of the area. If possible, cables 9 are run alongexisting cable routes of the other areas in order to reduce the cost oflaying cables.

As shown in FIG. 2, area A must be supplied with at least 68 phonelines, area B with at least 72 phone lines, area C with at least 78phone lines, area D with at least 57 phone lines, and area E with atleast 49 phone lines. This means that multiple copper distributioncables, whose utilization depends on the number of copper pairs neededas well as on the cable typology, must be laid in the individual areas.For example, a 20-pair copper distribution cable is needed for one sideof a city block A1 and a 50-pair copper distribution cable for the otherside of the block. Because of the way the cable distribution areas aredivided up, this means that the copper distribution cables havedifferent filling ratios [volumetric efficiencies].

The cable distribution areas formed in this manner must now be connectedto exchange (HVK) 7 via main cables (Hk) 9. For example, a main cablewith a net capacity of 49 copper pairs is needed to supply cabledistribution area E. This means that the main cable having the nexthigher pairing of 50 copper pairs, which is preferably used, is utilizedat a rate of up to 98%. The planner now has two choices for running themain cable of area E to exchange 7. He can run the main cable alongroutes to a cable distributor in an area A or D situated closer to theexchange in order to run the main cable of area E, along with the maincables of other areas, to a main cable having a higher capacity or adifferent technology, such as fiber optics. The planner can run the maincable of area E to the cable distributor of either area D or A. In thefirst case, the main cable leading from exchange 7 to the cabledistributor of area D must have a minimum capacity of 106 copper pairs(49 copper pairs in area E and 57 copper pairs in area D). In the secondcase, the main cable leading from exchange 7 to the cable distributor ofarea A must have a minimum capacity of 117 copper pairs (49 copper pairsin area E and 68 copper pairs in area D). However, since copper cableshaving a capacity of 117 or 109 copper pairs are not available, thecopper cable with the next higher capacity, i.e. 150 copper pairs, mustbe selected. Using a 150-pair copper cable, the main cable capacityutilization is 70.67% in the first case and 78% in the second case. Toselect the optimum network version, the cost of both options must now becalculated. This procedure is repeated for all cable distribution areas.

To provide an optimum network design, all possible combinations mustobviously be considered when delimiting the areas and routing the maincables. Selecting the wrong edges for the cable distribution areas inthe early stages of network planning produces subsequent errors whichcannot be corrected later on.

Because it can also take several weeks to set up a large networkmanually, and networks often must be set up under extreme time pressure,it is usually not possible to develop alternative solutions whendefining the areas. The network is therefore not optimized with a viewto efficient network utilization and cost minimization.

As a result, the method described above is not likely to enable thenetwork planner to set up the most cost-effective and profitable networkvariant.

SUMMARY OF THE INVENTION

The object of the present invention is to provide a method which can beused to generate a highly functional, low-cost network having a highlevel of capacity utilization in the shortest amount of time and withthe least amount of work.

According to the present invention, this object is achieved bygenerating, in a first process step, a graph composed of edges andnodes, the graph including all technically feasible and/or definablenetwork transmission paths, and the length and direction of the edgesbeing derived from the real topography of the street segments anddefinable cable paths of the territory to be supplied by the network,and the nodes forming the intersections between the edges or streetsand/or cable paths; by assigning, in a second process step, the users inthe territory to the graph in such a way that each user is connected tothe closest edge or the closest node in the graph by an additionalservice edge; by generating, in a third process step, the mostcost-effective tree structure by removing unnecessary edges from thegraph so that only one connection between the main distribution node andeach user is provided by the edges and nodes in the tree structure; bydetermining, in a fourth process step, the load carried by the edges inthe tree structure according to the user needs and requirements; and bydimensioning and selecting, in a subsequent fifth process step, thetechnologies to be used for each edge, service edge, and node in thetree structure on the basis of the edge loads calculated in the abovedescribed process steps.

The method according to the present invention can be used toadvantageously set up a network which is particularly short in length,allowing it to be generated especially economically since the costs ofmaterials and laying the cables are low, network capacity utilization,for another thing, being particularly high, keeping the carrier's costslow. The method can be used, in particular, for telecommunications,water, long-distance heat supply, and power networks. By converting themethod to a computer program that can run on a data processing system,the generated network can be easily optimized manually later on becausecertain transmission paths can be permanently defined for the graph, themethod being used to produce a network which routes, for example, thetelecommunications equipment, in particular the cables, along thesetransmission paths.

A complete network plan can be generated very quickly by applying themethod multiple times to different network levels, due to the varioustechnologies used for the levels. If a computer is used, for example,for a telecommunication network, the cable types to be laid, as well astheir lengths and pairings, are available in a database immediately uponcompletion of the method, along with the interconnections needed foreach node. This makes it possible to very quickly generate a list ofcosts and materials. Maps for network construction and maintenance canalso be created from the network plan data generated.

In the case of water networks, the required pipe types, along with theirdiameters and gradients, the necessary pumps and their locations, etc.,can be determined directly.

One advantage is that all process steps can be easily completed quicklyand conveniently using a computer program, making it possible togenerate any number of network plans for a territory in a relativelyshort amount of time. An optimum network plan can be drawn up graduallyby making minor changes to the defined street and route layoutparameters as well as the costs of materials and laying cables and thetechnology to be used for a specific network level. However, theseparameters can also be defined or selected for each step in generating anetwork plan, using a batch program or, for example, genetic algorithmsor evolutionary strategies. Using a computer makes it possible tooptimize a network plan without any subsequent manual work.

Another method of the present invention is directed to generating anetwork, in particular a telecommunications, water, long-distance heatsupply, or power network, the network connecting all users to a maindistribution node depending on the existing or definable local needs andrequirements of the individual users. A graph is generated composed ofedges and nodes. The graph includes all technically feasible and/ordefinable transmission paths of the network, and the length anddirection of the edges are derived from the real topography of thestreet segments and definable cable paths of the territory to besupplied by the network. The nodes form the intersections between theedges or streets and/or cable paths. The users are assigned to the graphso that each user is connected to the closest edge or the closest nodeof the graph by an additional service edge. A tree structure isgenerated by removing unnecessary edges from the graph in such a waythat the service edges, edges, and nodes of the tree structure form onlyone connection between the main distribution node and each user. Theload of the edges in the tree structure is determined depending on theneeds and requirements of the users.

The method according to the present invention is explained in greaterdetail below in its individual process steps on the basis of drawingsillustrating, by example, the setting up of a telecommunicationsnetwork.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a territory having individual users arranged along streets.

FIG. 2 shows the territory which was manually divided into areas A–E bya network planner using conventional methods.

FIG. 3 shows a network plan for the territory which was drawn upmanually by a network planner using conventional methods.

FIG. 4 shows a graph inserted into the territory using a methodaccording to the present invention, one edge for graph being providedalong each side of each street.

FIG. 4 a shows a section of the territory illustrated in FIG. 4, inwhich the method according to the present invention connects the usersto the graph via service edges.

FIG. 4 b shows a section of the territory in which a tree structure iscreated by connecting the users step by step to a portion of the treestructure already created.

FIG. 4 c shows the tree structure created for the territory using themethod according to the present invention and a load assigned to theedges.

FIG. 5 shows the territory having cable distribution sub-areas createdaccording to the present invention.

FIG. 5 a shows a section of the territory 1 with two cable distributionsub-areas being combined to form one cable distribution area.

FIG. 5 b shows a first section of FIG. 5 a, with the cable distributionarea being separated from the tree structure by two limit edges.

FIG. 5 c shows a second section of FIG. 5 a, with the limit edge of thecable distribution sub-area being connected to a closest node with aparticular requirement.

FIG. 6 shows the territory having the created cable distribution areasand cable distributors arranged in their distribution centers.

FIG. 7 shows a new tree structure created using a process according tothe present invention.

FIG. 8 shows the cable distribution areas, with pairings being assignedto individual edges or street segments.

DETAILED DESCRIPTION

For territory 1 illustrated in FIG. 1, composed of city blocks 2 onwhich users 3 are arranged at random as well as streets and definedcable paths 5 and their intersections 6, a telecommunication networkthat connects territory 1 to an exchange 7 is set up using the method,as shown in FIGS. 4 through 8. For purposes of illustration, only thoseusers 3 who need a service of the same type, such as phone lines, areprovided.

Because the method can be applied as often as necessary to specificlevels determined by the technologies, exchange 7 can, however, betreated like a distribution node 8.

FIG. 4 shows a street graph which was created in process step I. It isassumed that only streets exist, and no defined cable paths. An edge 14of graph G is assigned to each side of a street. This produces fournodes 15 at street intersections 6, a group of four street intersections11 forming, in each case, a separate edge 14.

In process step II, which is illustrated in FIG. 4 a, users 3 areconnected to graph G using service edges 16. For this purpose, eitherthe shortest path to graph G from the junction of particular user 3 mustbe selected, or service edge 16 must be run along a specific routeaccording to a particular preset parameter, thus determining the lengthof service edge 16. Where service edge 16 meets an edge 14 of graph G,this edge 14 is split into two edges 14 a, and the junction formed byedge 14 and service edge 16 becomes a new node 15 a. Edges 14 a thuscorrespond to edges 14.

At the end of process step II, all users 3 are connected to graph G. Asshown in FIGS. 4 b and 4 c, a tree structure Ba is generated in processstep III, each user 3 being connected to exchange 7 via a separateconnection, which is composed of service branches 16, edges 14, andnodes 15. For this purpose, graph G is searched for user 17 having thelowest cost of connecting to exchange 7. The connection costs aredetermined, for example, by the cable technology used and the cost oflaying the cables, including the excavation costs. This user 17, edges14, and nodes 15, which connect the latter to exchange 7, are thenmarked and form marked transmission path 18 (process step Ia). Next(process step Ib), all users 3 are connected to exchange 7 in successionso that user 19 whose cost of connecting to previously markedtransmission path 18 is lower than that of all as yet unmarked users 3,is always connected to exchange 7 first, taking into account previouslymarked edges 14 and/or nodes 15. The located transmission path is markedalong with its user. Process steps 1 a and 1 b are composed only ofsimple search algorithms and can be easily applied in the form of acomputer program.

Once all users 3 have been marked, i.e., are connected generated treestructure Ba, all unmarked edges 14 and nodes 15 of graph G areeliminated. Instead of eliminating edges 14 and nodes 15, however, it ispossible to use only marked edges 14 and nodes 15 for the remainingprocess steps. The latter variant certainly preferable from aprogramming standpoint.

Generated tree structure Ba is designed to minimize the connection costs(material and cable laying costs) for the defined, possible routes andcable layouts 5 in territory 1.

When designing a computer program, it can be useful to assign a load 21to remaining edges 14 of tree structure Ba in process step IV. Onepossible algorithm is described below. In carrying out the method,however, it makes little difference if a different algorithm is used,and, in each case, if necessary, load 21 of edges 14 is determined inprocess step V.

The possible algorithm is designed so that load “0” (zero) is initiallyassigned to all edges 14 of tree structure Ba, moving consecutively fromeach user 3 to exchange 7 along edges 14 and nodes 15, addingrequirement 4 of user 3, where the procedure was last started, to eachedge 14 traveled.

After the optimized tree structure or route graph has been drawn upusing the process steps described above, the way in which users 3connected to tree structure Ba are combined into cable distributionareas 26 is described below (FIGS. 5 and 6), the method continuing tooptimize the graph by generating as few cable distribution areas 26 aspossible by utilizing the equipment as efficiently as possible.

To generate cable distribution areas 26, the capacity of the individualcable distributors supplying the individual cable distribution areas isfirst defined (process step Va). This capacity depends on the technologyof the cable distributors used. The capacity determines the maximumnumber of copper pairs, glass fibers, etc. available for a cabledistribution area. The maximum ranges of the transmission equipment tobe used in cable distribution area 26 must also be defined, thuslimiting the size of cable distribution sub-areas 23 in process stepVb).

Depending on his requirements 4, an individual user 3 can form a singlecable distribution subarea 23 or even a separate cable distribution area26, in which case the requirements can be greater than the capacitydefined in process step Va). It is advisable to define these users 3,whose requirements 4 are greater than the cable distributor capacityspecified in step Va, as a single cable distribution area 26, each ofthese users 3 being assigned enough transmission equipment to cover theuser's requirements so that node 15 bordering on limit edge Gk of a user3 of this type is assigned a requirement corresponding to a multiple ofthe capacity defined in step Va for new tree structure 33 to be createdin process step Va), just covering the requirement of user 3; and tothen remove this user 3 from tree structure Ba, the node forming thedistribution center or location of the cable distributor assigned touser 3.

All markings are subsequently removed from users 3, provided that suchmarkings were previously set.

Tree structure Ba is then searched for an as yet unmarked user 22located at the end of a branch of tree structure Ba. This user 22 isidentified by the fact that the user, along with his service edge 16, isadjacent to a node on which only one edge 14 borders. Starting from thisuser 22, the planner moves along service edge 16, edges 14, and node 15in the direction of exchange 7 until reaching a limit edge Gk. A limitedge Gk is identified by the fact that it is connected to a node 15bordering on an edge 25 whose load 21 is greater than the load definedin process step Va). An edge 14 can, however, become a limit edge Gk ofa cable distribution sub-area 23 as soon as the range, starting fromuser 22, of the transmission equipment to be used for this cabledistribution area 26 (which is also defined in process step Va)) isexceeded, even if limit edge Gk would seem to belong to cabledistribution sub-area 23 based on its capacity.

FIG. 5 shows all cable distribution sub-areas 23 that are created withthe method described. Note that this breakdown into cable distributionsub-areas 23 is unique and can be reproduced.

Using subsequent process steps Vf) through Vp), cable distributionsub-areas 23 are now gradually combined or transformed, if possible,into cable distribution areas 26, making sure that load 30 of combinedcable distribution area 26 does not exceed the maximum capacity of cabledistributor 8. At the end of these process steps, each user 3 is thenclearly assigned to a cable distribution area 26.

When creating cable distribution areas 26, it should also be noted thatonly adjacent cable distribution subareas 23 can be combined, since theareas will otherwise lack cohesion. This would make it nearly impossiblefor the carrier to perform maintenance and error analysis work later onbecause conclusions as to the causes of errors that arise could nolonger be made in the event of a malfunction. Areas are adjacent whenthey border on the same node 15 and lie directly against one another ina clockwise or counter-clockwise direction.

Process steps Vf) through Vp) are explained in greater detail below withrespect to FIGS. 5 and 6, FIG. 5 depicting the initial situation onwhich process step Vf) is based, and FIG. 6 depicting the end resultafter completion of process step Vp).

In process step Vf), those cable distribution sub-areas 23 in treestructure Ba are first selected which cannot be combined with anyadjacent cable distribution sub-area 24 having a smaller or equivalentload, to form a larger cable distribution sub-area 23 because the totalload of both adjacent cable distribution sub-areas exceeds the cabledistributor capacity. These cable distribution sub-areas 23 aretransformed into cable distribution areas 26 and are removed from thetree structure in process steps Vh) and Vi), the requirements of thisnew cable distribution area 26 being subtracted from all edges 14connecting the latter to exchange 7 and ignored when creating the othercable distribution areas 26.

Below is a description of how cable distribution sub-areas 23 arecombined into larger cable distribution sub-areas 23. As illustrated inFIG. 5, the three cable distribution sub-areas 24 are adjacent to thesame node 28. None of the three cable distribution sub-areas 24 has yetbeen affected by the previous process steps since their requirementseither do not exceed the cable distributor capacity, or the sum theircapacities and that of the adjacent cable distribution subarea does notexceed the cable distributor capacity. The requirement of one cabledistribution sub-area 24 can therefore be derived directly from itslimit edge Gk. For example, the three cable distribution sub-areas 23bordering on node 28 have requirements 9, 77, and 20. The sum ofadjacent cable distribution sub-areas 23 yields either 86 or 97. In asubsequent process step, cable distribution sub-areas 24 are thencombined into a cable distribution area 26 whose total is the largest,i.e., the two cable distribution sub-areas having a total requirement of97. This cable distribution area 26 is now separated or removed from thetree structure and/or ignored for the remaining process steps (FIG. 5b). If more cable distribution sub-areas 24 were attached to node 28,they could also be combined. However, attention must be paid to ensuringnetwork cohesion. In the current example, however, only one single cabledistribution sub-area 24 is attached to node 28. Limit edge Gk of thiscable distribution sub-area is now run in the direction of exchange 7until its end facing away from cable distribution sub-area 23 meets nextnode 29, to which another cable distribution sub-area 23 is attached.Starting from this next node 29, the load of cable distribution area 26eliminated earlier is subtracted from edges 14 in the direction of theexchange (FIG. 5 c). Cable distribution sub-areas 23 continue to becombined until there are no longer any cable distribution sub-areas 23attached to tree structure Ba. As shown in FIG. 6, the method accordingto the present invention is used to divide the territory into four cabledistribution areas 26.

After users 3 have been assigned to created cable distribution areas 26,the individual distribution cables (VzK) connecting the cabledistributors to assigned users 3 can be dimensioned. Process steps Vu)through Vw) are completed for this purpose. Process step Vu) is thefirst step in dimensioning. Process step Vu) is the initialization step,assigning load “0” (zero) to all edges 14, 37 of tree structure Ba.Requirement 4 of each user is then added in step v), moving along edges14, 37 from users 3 and along node 15 to the cable distributor of cabledistribution area 26 belonging to user 3. In doing this, note that thecable distributors should, if possible, be located in the distributioncenter of the cable distribution area, the center being mapped to thenext node to prevent additional nodes from being created in the network.The distribution center is determined by the profitability of the centerto be moved and can be calculated, for example, by distributing users 3and their requirements 4. A variety of algorithms are known fordetermining the location of the distribution center or cabledistributor, and they can also be used in the method according to thepresent invention.

In step Vw), a distribution cable VzK, which corresponds to a pairingand whose capacity just covers the load of edge 14, is then assigned toeach edge 14, 37. This produces a network plan see (FIG. 8) for theindividual cable distribution areas which immediately reveals whichtechnology or which pairing 25 must be used for cable 34 to be laid, inorder to adequately supply the users connected to that cable.

The dimensioning of individual cable distribution areas 26 is thusconcluded.

Next, the cable distributors of cable distribution areas 26 must beconnected to the exchange. If territory 1 is large, however, it may benecessary to provide additional distribution nodes to supply the cabledistributors of cable distribution areas 26 created first and to combinedistribution areas into a new network level. In both situations, processstep V can be applied to the tree structure illustrated in FIG. 7,although without indicating the requirements of individual users 3, butrather the requirements of cable distribution areas 26 of the previousnetwork level, which is selectively represented by the cabledistributors attached to the tree structure. Loads 31 of the edges canagain be determined, and cable distribution sub-areas as well as cabledistribution areas formed on the new network level. The method cancontinue to be applied to this network level.

A slightly modified version of the method can also be applied tonetworks in which the different requirements of the users make itnecessary to provide multiple pieces of equipment side-by-side on anetwork level, the equipment being connected to exchange 7 on the nexthigher or lower network level, using a single piece of equipment. At thesame time, this is also taken into account when delimiting cabledistribution sub-areas 23 and cable distribution areas 26.

Those skilled in the art can easily apply the described method accordingto the present invention to other network systems, such as along-distance heat supply or water supply network. In these networks,the pipes are also run along routes or streets which are combined ordistributed at street intersections. According to the method, thesejunctions are defined as nodes 15 and the pipe routes as edges 14.Exchange 7 is replaced by a main distribution node of the long-distanceheat supply network. Because the requirements represent an abstractnumber in the method, and the long-distance heat supply requirements ofthe individual users can also be represented by a number, the methoddoes not need to be changed in this regard, for example in order toapply it to a long-distance heat supply network.

LIST OF REFERENCE NUMBERS

-   1. Supply territory-   2. City block-   3. User-   4. User requirements-   5. Streets or defined cable path-   6. Street or cable intersection-   7. Main distribution node (HVK) or exchange (Vst)-   8. Distribution nodes (KVZA–KVZE=cable distributors for areas A–E)-   9. Cables with data lines-   10. Transmission line to user-   11. Street intersection with cable run underground.-   12. Cable path to main distribution node.-   13. Cable for area E is laid in a cable pit together with part of    the cable for area D-   14. Edge representing one side of a street-   15. Node, junction for the edges (14)-   16. Service edge to user-   17. User with the lowest cost of connection to the exchange (HVK, 7)-   18. Marked transmission path from the exchange (7) to the user (17)-   19. User with the lowest cost of connection to marked transmission    path 18-   20. Users subsequently connected to the previously marked edges (14)    and nodes (15) using the method-   21. Load on the edges (14)-   22. User in process step Vb)-   23. Cable distribution sub-area-   24. Cable distribution sub-areas (23) whose limit edges (Gk) are    attached to the same node-   25. Edge in process step Vc)-   26. Cable distribution area in process step Vg)-   27. Eliminated cable distribution area, process step Vh)-   28. Node bordered by the limit edges (Gk) of multiple cable    distribution sub-areas (23)-   29. Closest node; process step Vi)-   30. Requirements of a cable distribution area (26)-   31. Load of edges (23)-   32. Edges of the new tree structure (33) created in process step Vs)-   33. New tree structure created in process step Vs)-   34. Distribution cable (VzK)-   35. Pairing of distribution cable (34)-   36. Node shared by the two cable distribution areas 2 and 4 in which    the distribution cables of both cable distribution areas run    parallel-   37. Edge-   A–E Areas in supply territory (1)-   Ba Tree structure-   CuDA Copper pair-   Cu-VzK Copper distribution cable-   Gk Limit edge of a cable distribution sub-area (23)-   Hk Main cable-   HVK Exchange (7)-   KVz Terminal for the distribution cable of the cable distribution    area-   Kvz area Cable distribution area-   VzK Distribution cable (34)

1. A method for generating a network which connects all users residingwithin a particular territory to a main distribution node comprising thesteps of: a) generating a network plan using the following substeps: i)generating a graph which represents the network and which is composed ofedges and nodes, the edges representing all transmission paths in thenetwork, wherein a length and a direction of each of the edges isdetermined as a function of a real topography of street segments anddefinable cable paths of a particular territory associated with thenetwork, the nodes representing intersections between at least one ofthe street segments and the definable cable paths; ii) assigning theusers to the graph, each of the users being connected to one of aclosest edge of the edges and a closest node of the nodes via at leastone service edge; iii) generating a tree structure by removingunnecessary edges of the edges from the graph so that only oneparticular connection exists between the main distribution node and eachof the users, wherein the particular connection is composed of the atleast one service edge, the edges and the nodes of the tree structure;A) determining a particular user of the users who has a first path ofthe transmission paths to the main distribution node along the graphwhich generates lowest provisioning costs compared to remaining users ofthe users, and marking the particular user, first edges of the edges andfirst nodes of the nodes which form the first path, B) after substep(a)(iii)(A), selecting an unmarked user of the users has a second pathof the transmission paths to the main distribution node which is a mosteconomical path, the most economical path being determined using thefirst edges and the first nodes, and marking the unmarked user, secondedges of the edges and second nodes of the node, the second edges andthe second nodes forming the second path, C) repeating substep(a)(iii)(B) until all of the users are marked, and D) removingparticular edges of the edges and particular nodes of the node from thegraph, the particular edges and the particular node being unmarked; andiv) determining at least one load of the edges of the tree structure asa function of at least one requirements for each of the users to providethe network plan; and b) generating the network according to the networkplan.
 2. A method for generating a network which connects all usersresiding within a particular territory to a main distribution node,comprising the steps of: a) generating a network plan using thefollowing substeps: i) generating a graph which represents the networkand which is composed of edges and nodes, the edges representing alltransmission paths in the network, wherein a length and a direction ofeach of the edges is determined as a function of a real topography ofstreet segments and definable cable paths of a particular territoryassociated with the network, the nodes representing intersectionsbetween at least one of the street segments and the definable cablepaths, ii) assigning the users to the graph, each of the users beingconnected to one of a closest edge of the edges and a closest node ofthe nodes via at least one service edge, iii) generating a treestructure by removing unnecessary edges of the edges from the graph sothat only one particular connection exists between the main distributionnode and each of the users, wherein the particular connection iscomposed of the at least one service edge, the edges and the nodes ofthe tree structure, and iv) determining at least one load of the edgesof the tree structure as a function of at least one requirements foreach of the users to provide the network plan; and b) generating thenetwork according to the network plan, wherein each street segment inthe particular territory is defined by two particular edges of the edgesduring substep (a)(ii), each of the two particular edges representingone side of a particular segment of the street segments, wherein each ofthe segments is delimited and dimensioned, and the particular technologyto be used for each of the edges is determined according to thefollowing substeps: A) defining at least one of the respectivetransmission capacity of cable distributors and the respective maximumrange of a transmission equipment to be used for at least one cabledistribution area, the capacity being determined from the transmissionequipment, B) selecting to a particular user of the users having the atleast one service edge which is connected to a particular node of thenodes which is connected to only one further edge of the edges, C)starting at the particular user, extending the at least one serviceedge, the edges and the nodes of the tree structure in a direction of anexchange to reach a limit edge, the limit edge bordering a further nodeof the nodes which is connected to a further edge of the edges, thefurther edge having a respective load exceeding at least one of therespective transmission capacity and the respective maximum range of oneof the cable distributors and the at least one cable distribution area,D) marking specific users of the users which are connected to theexchange via the limit edge, and assigning each of the specific users toa respective cable distribution subarea, and E) repeating steps B)through D) until all the users are assigned to respective cabledistribution subareas.
 3. The method according to claim 2, wherein,after substep (E), all of the respective cable distribution subareas arerecursively combined into the at least one cable distribution area sothat the at least one load of each of the at least one cabledistribution area does not exceed the capacity of a respectivedistributor of the cable distributors, and wherein each of the users isassigned to only one cable distribution area.
 4. The method according toclaim 2, wherein a particular subarea of the cable distribution subareasis not combinable with an adjacent subarea of the cable distributionsubareas which has a particular load that is smaller or equal to therespective load of the particular subarea, and wherein the particularsubarea is combined with another subarea of the at least one cabledistribution area to form a larger cable distribution subarea byselecting the particular subarea from the tree structure.
 5. The methodaccording to claim 2, wherein only particular subareas of the cabledistribution subareas which are directly adjacent to one another arecombined into the at least one cable distribution area.
 6. The methodaccording to claim 3, further comprising the substeps of: F) aftersubstep (E), searching the tree structure for at least one furthersubarea of the respective cable distribution subareas, the at least onefurther subarea having a first load which is combined with a second loadof a directly adjacent subarea of the respective cable distributionsubareas, the second load being smaller or equal to the first load, thedirectly adjacent subarea having a respective limit edge which borderson a same node of the nodes of the at least one further subarea, thefirst load having a respective capacity which is greater than thecapacity of the cable distributor, G) combining additional subareas ofthe cable distribution subareas which are located in the tree structureinto a particular area of the at least one cable distribution area, theadditional subareas excluding smallest subareas of the at least onecable distribution subarea, H) removing the additional subareas from thetree structure, and ignoring the additional subareas when generating atleast one remaining area of the at least one cable distribution area toseparate or ignore all of the users, the service edges, the edges andthe nodes connected to the exchange by the limit edge from the treestructure, the respective load of the separated areas being subtractedfrom the respective load of all of the edges which connect the edges tothe exchange, and J) determining if any further limit edge of theadditional subareas borders a further node of the nodes which connectsthe separated areas to the exchange, wherein, if the further limit edgesare not present, a connecting node of the nodes, further edges of theedges and further nodes of the nodes which connect the connecting nodeto a next node on which the further limit edge borders are removed. 7.The method according to claim 6, wherein further cable distributionareas are generated using the following substeps: K) checking if theconnecting node is connected to a single edge of the edges and to thelimit edge, the respective load of the single edge being greater thanall other edges which are provided in the tree structure, L) if a sum ofthe respective loads of the respective cable distribution subareasadjacent to the connected node is less than or equal to the capacity ofthe cable distributor, combining all of the respective cabledistribution subareas into a further cable distribution subarea having aparticular load which is equal to the sum of the respective loads, andperforming substep (a)(I), M) if the sum of the respective loads isgreater than the capacity of the cable distributor, combining adjacentsubareas of the cable distribution subareas having largest respectiveloads, the largest respective load being smaller than the capacity ofthe cable distributor, and forming the further cable distributionsubarea, N) removing the further cable distribution subarea from thetree structure, or ignoring the further cable distribution subareas whencreating the at least one cable distribution area, subtracting therespective load of an eliminated area of the at least one cabledistribution area from an assigned load of particular edges whichconnect the particular area to the exchange, if any of the respectivecable distribution subareas are attached to the tree structure,performing substep (F), and ending the generation of the network if noneof the cable distribution subareas are attached to the tree structure,O) assigning the respective particular edge which connects the connectednode to the exchange as a further limit edge of a new cable distributionsubarea, P) if the further limit edge is adjacent to a further node ofthe nodes on which no further limit edges border, determining a nextnode of the nodes on which another limit edge borders by starting fromthe further limit edge and extending toward the exchange, Q) if nofurther nodes are found in substep (P), assigning the further cabledistribution subarea to the particular area of the at least one cabledistribution area and completing the generation of the network, and R)connecting the limit edge of the further cable distribution subarea tothe further node, and repeating substeps (F) through (O).
 8. The methodaccording to claim 2, wherein, after the at least one cable distributionarea is completed, performing the following substeps: S) determining adistribution center of each of the at least one cable distribution areain relation to a location and the requirements of each of the users whoare assigned to the at least one cable distribution area, wherein one ofthe nodes of the at least one cable distribution area forms thedistribution center and simultaneously forms a junction between thecable distribution area and the network being generated, T) assigningthe respective load of the at least one cable distribution area to thedistribution center, U) generating a further tree structure, marking allof the nodes and all of the edges of the tree structure generated insubstep (a)(ii) which connect the distribution centers defined as nodesto the exchange, and removing or ignoring unmarked users of the users,unmarked service edges of the service edges, unmarked nodes of the nodesand unmarked edges of the edges from the further tree structure.
 9. Themethod according to claim 6, wherein each of additional users of theusers having the respective loads which are greater than the capacity ofthe cable distributor are defined as a single area of the at least onecable distribution area prior to completing substep (F), each of theadditional users being assigned with a predetermined number ofconnections to cover particular requirements of each of the furtherusers, wherein the next node is assigned with a further requirement fora further tree structure which is a multiple of the capacity to coverthe requirements of each of the additional users, and each of theadditional users is removed from the further tree structure, the nextnode forming one of the distribution center and the location of thecable distributor assigned to the next user.